0.00/0.09	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.09/0.11	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.11/0.31	% Computer   : n008.cluster.edu
0.11/0.31	% Model      : x86_64 x86_64
0.11/0.31	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.31	% Memory     : 8042.1875MB
0.11/0.31	% OS         : Linux 3.10.0-693.el7.x86_64
0.11/0.31	% CPULimit   : 1200
0.11/0.31	% WCLimit    : 120
0.11/0.31	% DateTime   : Tue Jul 13 13:28:14 EDT 2021
0.11/0.31	% CPUTime    : 
0.11/0.31	% Number of cores: 8
0.11/0.31	% Python version: Python 3.6.8
0.11/0.31	# Version: 2.6rc1-ho
0.11/0.32	# No SInE strategy applied
0.11/0.32	# Trying AutoSched0 for 59 seconds
0.48/0.66	# AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S06DN
0.48/0.66	# and selection function SelectNewComplexAHPExceptUniqMaxHorn.
0.48/0.66	#
0.48/0.66	# Preprocessing time       : 0.071 s
0.48/0.66	# Presaturation interreduction done
0.48/0.66	
0.48/0.66	# Proof found!
0.48/0.66	# SZS status Theorem
0.48/0.66	# SZS output start CNFRefutation
0.48/0.66	thf(fact_32_siftDown_Osimps_I6_J, axiom, ![X197:a, X198:tree_a, X199:tree_a, X194:a, X195:tree_a, X196:tree_a, X8:a]:((~(ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ (val_a @ (t_a @ X194 @ X195 @ X196)))=>((ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ X8=>(heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))&((heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ (t_a @ X194 @ X195 @ X196) @ (heapIm1091024090Down_a @ (t_a @ X8 @ (heapIm1140443833left_a @ (t_a @ X197 @ X198 @ X199)) @ (heapIm1257206334ight_a @ (t_a @ X197 @ X198 @ X199)))))<=~(ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ X8))))&(((~(ord_less_eq_a @ (val_a @ (t_a @ X194 @ X195 @ X196)) @ X8)=>(heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ (val_a @ (t_a @ X194 @ X195 @ X196)) @ (heapIm1091024090Down_a @ (t_a @ X8 @ (heapIm1140443833left_a @ (t_a @ X194 @ X195 @ X196)) @ (heapIm1257206334ight_a @ (t_a @ X194 @ X195 @ X196)))) @ (t_a @ X197 @ X198 @ X199)))&((heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199))<=ord_less_eq_a @ (val_a @ (t_a @ X194 @ X195 @ X196)) @ X8))<=ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ (val_a @ (t_a @ X194 @ X195 @ X196)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_32_siftDown_Osimps_I6_J)).
0.48/0.66	thf(fact_30_val_Osimps, axiom, ![X8:a, X160:tree_a, X161:tree_a]:(val_a @ (t_a @ X8 @ X160 @ X161))=(X8), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_30_val_Osimps)).
0.48/0.66	thf(conj_0, conjecture, (multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)).
0.48/0.66	thf(fact_1_True, axiom, ord_less_eq_a @ v1 @ v, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_True)).
0.48/0.66	thf(fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062, axiom, ord_less_eq_a @ v2 @ v1, file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062)).
0.48/0.66	thf(c_0_5, plain, ![X197:a, X198:tree_a, X199:tree_a, X194:a, X195:tree_a, X196:tree_a, X8:a]:((~ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ (val_a @ (t_a @ X194 @ X195 @ X196))=>((ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ X8=>(heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))&(~ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ X8=>(heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ (t_a @ X194 @ X195 @ X196) @ (heapIm1091024090Down_a @ (t_a @ X8 @ (heapIm1140443833left_a @ (t_a @ X197 @ X198 @ X199)) @ (heapIm1257206334ight_a @ (t_a @ X197 @ X198 @ X199))))))))&(ord_less_eq_a @ (val_a @ (t_a @ X197 @ X198 @ X199)) @ (val_a @ (t_a @ X194 @ X195 @ X196))=>((~ord_less_eq_a @ (val_a @ (t_a @ X194 @ X195 @ X196)) @ X8=>(heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ (val_a @ (t_a @ X194 @ X195 @ X196)) @ (heapIm1091024090Down_a @ (t_a @ X8 @ (heapIm1140443833left_a @ (t_a @ X194 @ X195 @ X196)) @ (heapIm1257206334ight_a @ (t_a @ X194 @ X195 @ X196)))) @ (t_a @ X197 @ X198 @ X199)))&(ord_less_eq_a @ (val_a @ (t_a @ X194 @ X195 @ X196)) @ X8=>(heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))=(t_a @ X8 @ (t_a @ X194 @ X195 @ X196) @ (t_a @ X197 @ X198 @ X199)))))), inference(fof_simplification,[status(thm)],[fact_32_siftDown_Osimps_I6_J])).
0.48/0.66	thf(c_0_6, plain, ![X1624:a, X1625:tree_a, X1626:tree_a, X1627:a, X1628:tree_a, X1629:tree_a, X1630:a]:(((~ord_less_eq_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ X1630|(heapIm1091024090Down_a @ (t_a @ X1630 @ (t_a @ X1627 @ X1628 @ X1629) @ (t_a @ X1624 @ X1625 @ X1626)))=(t_a @ X1630 @ (t_a @ X1627 @ X1628 @ X1629) @ (t_a @ X1624 @ X1625 @ X1626))|ord_less_eq_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ (val_a @ (t_a @ X1627 @ X1628 @ X1629)))&(ord_less_eq_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ X1630|(heapIm1091024090Down_a @ (t_a @ X1630 @ (t_a @ X1627 @ X1628 @ X1629) @ (t_a @ X1624 @ X1625 @ X1626)))=(t_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ (t_a @ X1627 @ X1628 @ X1629) @ (heapIm1091024090Down_a @ (t_a @ X1630 @ (heapIm1140443833left_a @ (t_a @ X1624 @ X1625 @ X1626)) @ (heapIm1257206334ight_a @ (t_a @ X1624 @ X1625 @ X1626)))))|ord_less_eq_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ (val_a @ (t_a @ X1627 @ X1628 @ X1629))))&((ord_less_eq_a @ (val_a @ (t_a @ X1627 @ X1628 @ X1629)) @ X1630|(heapIm1091024090Down_a @ (t_a @ X1630 @ (t_a @ X1627 @ X1628 @ X1629) @ (t_a @ X1624 @ X1625 @ X1626)))=(t_a @ (val_a @ (t_a @ X1627 @ X1628 @ X1629)) @ (heapIm1091024090Down_a @ (t_a @ X1630 @ (heapIm1140443833left_a @ (t_a @ X1627 @ X1628 @ X1629)) @ (heapIm1257206334ight_a @ (t_a @ X1627 @ X1628 @ X1629)))) @ (t_a @ X1624 @ X1625 @ X1626))|~ord_less_eq_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ (val_a @ (t_a @ X1627 @ X1628 @ X1629)))&(~ord_less_eq_a @ (val_a @ (t_a @ X1627 @ X1628 @ X1629)) @ X1630|(heapIm1091024090Down_a @ (t_a @ X1630 @ (t_a @ X1627 @ X1628 @ X1629) @ (t_a @ X1624 @ X1625 @ X1626)))=(t_a @ X1630 @ (t_a @ X1627 @ X1628 @ X1629) @ (t_a @ X1624 @ X1625 @ X1626))|~ord_less_eq_a @ (val_a @ (t_a @ X1624 @ X1625 @ X1626)) @ (val_a @ (t_a @ X1627 @ X1628 @ X1629))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
0.48/0.66	thf(c_0_7, plain, ![X1503:a, X1504:tree_a, X1505:tree_a]:(val_a @ (t_a @ X1503 @ X1504 @ X1505))=(X1503), inference(variable_rename,[status(thm)],[fact_30_val_Osimps])).
0.48/0.66	thf(c_0_8, negated_conjecture, (multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.48/0.66	thf(c_0_9, plain, ![X8:a, X5:tree_a, X7:tree_a, X18:a, X34:tree_a, X17:a, X6:tree_a]:((heapIm1091024090Down_a @ (t_a @ X17 @ (t_a @ X8 @ X5 @ X6) @ (t_a @ X18 @ X7 @ X34)))=(t_a @ X17 @ (t_a @ X8 @ X5 @ X6) @ (t_a @ X18 @ X7 @ X34))|~ord_less_eq_a @ (val_a @ (t_a @ X8 @ X5 @ X6)) @ X17|~ord_less_eq_a @ (val_a @ (t_a @ X18 @ X7 @ X34)) @ (val_a @ (t_a @ X8 @ X5 @ X6))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.48/0.66	thf(c_0_10, plain, ![X6:tree_a, X5:tree_a, X8:a]:(val_a @ (t_a @ X8 @ X5 @ X6))=(X8), inference(split_conjunct,[status(thm)],[c_0_7])).
0.48/0.66	thf(c_0_11, negated_conjecture, (multiset_a2 @ (heapIm1091024090Down_a @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))))!=(multiset_a2 @ (t_a @ v @ (t_a @ v1 @ l1 @ r1) @ (t_a @ v2 @ l2 @ r2))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.48/0.66	thf(c_0_12, plain, ![X6:tree_a, X5:tree_a, X8:a, X7:tree_a, X34:tree_a, X18:a, X17:a]:((heapIm1091024090Down_a @ (t_a @ X8 @ (t_a @ X17 @ X5 @ X6) @ (t_a @ X18 @ X7 @ X34)))=(t_a @ X8 @ (t_a @ X17 @ X5 @ X6) @ (t_a @ X18 @ X7 @ X34))|~ord_less_eq_a @ X17 @ X8|~ord_less_eq_a @ X18 @ X17), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10]), c_0_10]), c_0_10])).
0.48/0.66	thf(c_0_13, plain, ord_less_eq_a @ v1 @ v, inference(split_conjunct,[status(thm)],[fact_1_True])).
0.48/0.66	thf(c_0_14, plain, ord_less_eq_a @ v2 @ v1, inference(split_conjunct,[status(thm)],[fact_0__092_060open_062v2_A_092_060le_062_Av1_092_060close_062])).
0.48/0.66	thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13]), c_0_14])]), ['proof']).
0.48/0.66	# SZS output end CNFRefutation
0.48/0.66	# Proof object total steps             : 16
0.48/0.66	# Proof object clause steps            : 7
0.48/0.66	# Proof object formula steps           : 9
0.48/0.66	# Proof object conjectures             : 4
0.48/0.66	# Proof object clause conjectures      : 2
0.48/0.66	# Proof object formula conjectures     : 2
0.48/0.66	# Proof object initial clauses used    : 5
0.48/0.66	# Proof object initial formulas used   : 5
0.48/0.66	# Proof object generating inferences   : 1
0.48/0.66	# Proof object simplifying inferences  : 6
0.48/0.66	# Training examples: 0 positive, 0 negative
0.48/0.66	# Parsed axioms                        : 269
0.48/0.66	# Removed by relevancy pruning/SinE    : 0
0.48/0.66	# Initial clauses                      : 879
0.48/0.66	# Removed in clause preprocessing      : 96
0.48/0.66	# Initial clauses in saturation        : 783
0.48/0.66	# Processed clauses                    : 2965
0.48/0.66	# ...of these trivial                  : 35
0.48/0.66	# ...subsumed                          : 1352
0.48/0.66	# ...remaining for further processing  : 1578
0.48/0.66	# Other redundant clauses eliminated   : 298
0.48/0.66	# Clauses deleted for lack of memory   : 0
0.48/0.66	# Backward-subsumed                    : 13
0.48/0.66	# Backward-rewritten                   : 13
0.48/0.66	# Generated clauses                    : 6548
0.48/0.66	# ...of the previous two non-trivial   : 5854
0.48/0.66	# Contextual simplify-reflections      : 9
0.48/0.66	# Paramodulations                      : 6060
0.48/0.66	# Factorizations                       : 18
0.48/0.66	# NegExts                              : 0
0.48/0.66	# Equation resolutions                 : 319
0.48/0.66	# Propositional unsat checks           : 0
0.48/0.66	#    Propositional check models        : 0
0.48/0.66	#    Propositional check unsatisfiable : 0
0.48/0.66	#    Propositional clauses             : 0
0.48/0.66	#    Propositional clauses after purity: 0
0.48/0.66	#    Propositional unsat core size     : 0
0.48/0.66	#    Propositional preprocessing time  : 0.000
0.48/0.66	#    Propositional encoding time       : 0.000
0.48/0.66	#    Propositional solver time         : 0.000
0.48/0.66	#    Success case prop preproc time    : 0.000
0.48/0.66	#    Success case prop encoding time   : 0.000
0.48/0.66	#    Success case prop solver time     : 0.000
0.48/0.66	# Current number of processed clauses  : 970
0.48/0.66	#    Positive orientable unit clauses  : 85
0.48/0.66	#    Positive unorientable unit clauses: 3
0.48/0.66	#    Negative unit clauses             : 323
0.48/0.66	#    Non-unit-clauses                  : 559
0.48/0.66	# Current number of unprocessed clauses: 3862
0.48/0.66	# ...number of literals in the above   : 10052
0.48/0.66	# Current number of archived formulas  : 0
0.48/0.66	# Current number of archived clauses   : 555
0.48/0.66	# Clause-clause subsumption calls (NU) : 210578
0.48/0.66	# Rec. Clause-clause subsumption calls : 58254
0.48/0.66	# Non-unit clause-clause subsumptions  : 595
0.48/0.66	# Unit Clause-clause subsumption calls : 33172
0.48/0.66	# Rewrite failures with RHS unbound    : 0
0.48/0.67	# BW rewrite match attempts            : 72
0.48/0.67	# BW rewrite match successes           : 46
0.48/0.67	# Condensation attempts                : 0
0.48/0.67	# Condensation successes               : 0
0.48/0.67	# Termbank termtop insertions          : 167959
0.48/0.67	
0.48/0.67	# -------------------------------------------------
0.48/0.67	# User time                : 0.334 s
0.48/0.67	# System time              : 0.015 s
0.48/0.67	# Total time               : 0.349 s
0.48/0.67	# Maximum resident set size: 2316 pages
0.48/0.67	EOF